New lower and upper bounds for the competitive ratio of transmission protocols

نویسندگان

  • Maciej Liskiewicz
  • Bodo Manthey
چکیده

Transmission protocols like TCP are usually divided into a time scheduling and a data selection policy. We consider on-line algorithms of data selection policies for any time scheduling policy and any routing behaviour in a network. For the model introduced by Adler et al. (1997, Proc. of the 5th Isreal Symp. on the Theory of Computing Systems, pp. 64–72), we improve both the lower and the upper bound on the competitive ratio making them asymptotically tight. Furthermore, we present a lower bound that depends on the size of the buffers that are available both to the sender and to the receiver. We obtain a constant lower bound for the competitive ratio for constant buffer size.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers

The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...

متن کامل

Estimating ‎U‎pper and Lower Bounds For Industry Efficiency With Unknown ‎Technology‎

With a brief review of the studies on the industry in Data Envelopment Analysis (DEA) framework, the present paper proposes inner and outer technologies when only some basic information is available about the technology. Furthermore, applying Linear Programming techniques, it also determines lower and upper bounds for directional distance function (DDF) measure, overall and allocative efficienc...

متن کامل

Strong exponent bounds for the local Rankin-Selberg convolution

Let $F$ be a non-Archimedean locally compact field‎. ‎Let $sigma$ and $tau$ be finite-dimensional representations of the Weil-Deligne group of $F$‎. ‎We give strong upper and lower bounds for the Artin and Swan exponents of $sigmaotimestau$ in terms of those of $sigma$ and $tau$‎. ‎We give a different lower bound in terms of $sigmaotimeschecksigma$ and $tauotimeschecktau$‎. ‎Using the Langlands...

متن کامل

Upper and lower bounds for numerical radii of block shifts

For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 89  شماره 

صفحات  -

تاریخ انتشار 2004